Project-Team:AROMATH

Project-Team Aromath

Members

Overall Objectives

Research Program

High order geometric modeling
Robust algebraic-geometric computation

Application Domains

Geometric modeling for Design and Manufacturing.
Geometric modeling for Numerical Simulation and Optimization

New Software and Platforms

AXEL

New Results

Flat extensions in ∗-algebras
On deflation and multiplicity structure
On the construction of general cubature formula by flat extensions
Geometrically continuous splines for surfaces of arbitrary topology
Border Basis for Polynomial System Solving and Optimization
Bit complexity of bivariate systems
Compact formulae in sparse elimination
Computation of the Invariants of Finite Abelian Groups
Extraction of cylinders and cones from minimal point sets
Resultant of an equivariant polynomial system with respect to the symmetric group
A Line/Trimmed NURBS Surface Intersection Algorithm Using Matrix Representations
Effective criteria for bigraded birational maps
Geometric model for shape deformation
Shape-optimization of 2D hydrofoils using an Isogeometric BEM solver
Algebraic method for constructing singular steady solitary waves: A case study

Partnerships and Cooperations

Regional Initiatives
European Initiatives
International Initiatives
International Research Visitors

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries

Bibliography

Publications of the year
References in notes

Inria | Raweb 2016 | Presentation of the Project-Team AROMATH | AROMATH Web Site


	PDF	e-Pub

Previous |

Home | Next next

Section: New Results

Bit complexity of bivariate systems

Participant : Ioannis Emiris.

The paper [14] studies the bit complexity of solving systems of bivariate polynomial equations. By means of adapted resultant formulations we thus improve upon the existing general bounds.

Previous |

Home | Next next